On Reduced Polytopes and Antipodality

نویسندگان

  • Gennadiy Averkov
  • Horst Martini
چکیده

Let B be an o-symmetric convex body in R, and M be the normed space with unit ball B. The M-thickness ∆B(K) of a convex body K ⊆ R is the smallest possible Mdistance between two distinct parallel supporting hyperplanes of K. Furthermore, K is said to be M-reduced if ∆B(K ′) < ∆B(K) for every convex body K ′ with K ′ ⊆ K and K ′ 6= K. In our main theorems we describe M-reduced polytopes as polytopes whose face lattices possess certain antipodality properties. As one of the consequences, we obtain that if the boundary of B is regular, then a d-polytope with m facets and n vertices is not M-reduced for m = d + 2 or n = d + 2 or n > m. The latter statement yields a new partial answer to Lassak’s question on the existence of Euclidean reduced d-polytopes for d ≥ 3. 2000 Mathematics Subject Classification. Primary 52A20, 52B12; Secondary 52A21, 46B20

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Reduced Bodies, Regularity of Norms, and Related Antipodality Properties

The thickness (or minimum width) of a convex body K in Euclidean space E, d ≥ 2, is the minimal distance between two distinct parallel supporting hyperplanes of K. The body K is said to be reduced if no proper convex subset of K has the same thickness. It is natural to study the notions of thickness and reduced body also in Minkowski spaces (that is, in real normed linear spaces of finite dimen...

متن کامل

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

متن کامل

Hypercube Related Polytopes

Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.

متن کامل

h-Polynomials via Reduced Forms

The flow polytope F G̃ is the set of nonnegative unit flows on the graph G̃. The subdivision algebra of flow polytopes prescribes a way to dissect a flow polytope F G̃ into simplices. Such a dissection is encoded by the terms of the so called reduced form of the monomial ∏ (i,j)∈E(G) xij . We prove that we can use the subdivision algebra of flow polytopes to construct not only dissections, but als...

متن کامل

Essential Hyperbolic Coxeter Polytopes

We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter polytopes. We determine a potentially large combinatorial class of polytopes containing, in particular, all the compact hyperbolic Coxeter polytopes of dimens...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007